A note on the Ramsey number of stars — Complete graphs
نویسندگان
چکیده
منابع مشابه
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
We give a lower bound for the Ramsey number and the planar Ramsey number for C4 and complete graphs. We prove that the Ramsey number for C4 and K7 is 21 or 22. Moreover we prove that the planar Ramsey number for C4 and K6 is equal to 17.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA note on Ramsey size-linear graphs
We show that if G is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every cycle in G contains at least four consecutive vertices of degree 2 then G is Ramsey size-linear. ß 2002 John Wiley & Sons, Inc. J Graph Theory 39: 1–5, 2002
متن کاملOn the Ramsey multiplicity of complete graphs
We show that, for n large, there must exist at least nt C(1+o(1))t 2 monochromatic Kts in any two-colouring of the edges of Kn, where C ≈ 2.18 is an explicitly defined constant. The old lower bound, due to Erdős [E62], and based upon the standard bounds for Ramsey’s theorem, is nt 4(1+o(1))t 2 .
متن کاملA note on regular Ramsey graphs
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C √ n log n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.01.007